S Imulation and a Nalysis of a Odv , D Sdv , Z Rp in V Anet
نویسندگان
چکیده
The main aim of this paper is to present comprehensive study on the performance and behavior of Ondemand Distance Vector Routing approach (AODV), Table Driven Routing approach (DSDV) and Hybrid Routing approach (ZRP) in VANETs. VANETs are an enhanced form of MANETs where moving nodes are replaced by vehicles. This paper evaluates these protocols under realistic mobility models to analyze their performance in VANETs. To evaluate the performance of given protocols, different set of scenarios with varying nodes density have been simulated with the help of simulators NS-2, SUMO and MOVE.
منابع مشابه
Amitraz Poisoning; A case study
A m i t r a z, a n i ns e c t i c i d e /a ca ri c i de of the f o r m a m i d i n e p e st i c i d e s group, is a ? 2 a d r e n e r g i c ag on i st a nd of t he a m i d i ne c h e m i ca l f a m il y generally us e d to c o n t r ol animal e c top a r a s i t e s. Poisoning due to am i t r a z i s r a r e and character...
متن کاملEFFECTS OF TEMPERATURE AND PERCENTAGE OF ORGANIC MODIFIER ON RETENTION AND SELECTIVITY IN RP-HPLC USING SOLVATION PARAMETER MODEL
Effects of temperature and percentage of organic modifier were studied on retention and selectivity in RP-HPLC using solvation parameter model. The system constants were determined by multiple linear regression analysis from experimental values in the retention factor for a group of different solutes with known descriptors by computer using the program SPSS/PC. The experimental results showed t...
متن کاملOn computing the general Narumi-Katayama index of some graphs
The Narumi-Katayama index was the first topological index defined by the product of some graph theoretical quantities. Let $G$ be a simple graph with vertex set $V = {v_1,ldots, v_n }$ and $d(v)$ be the degree of vertex $v$ in the graph $G$. The Narumi-Katayama index is defined as $NK(G) = prod_{vin V}d(v)$. In this paper, the Narumi-Katayama index is generalized using a $n$-ve...
متن کاملOn the zero forcing number of some Cayley graphs
Let Γa be a graph whose each vertex is colored either white or black. If u is a black vertex of Γ such that exactly one neighbor v of u is white, then u changes the color of v to black. A zero forcing set for a Γ graph is a subset of vertices Zsubseteq V(Γ) such that if initially the vertices in Z are colored black and the remaining vertices are colored white, then Z changes the col...
متن کاملA New Stability Indicating RP-HPLC Method Development and Validation for the Simultaneous Estimation of Dolutegravir and Rilpivirine in Bulk and its Dosage Forms
A New Stability Indicating RP-HPLC Method Development and Validation for the Simultaneous Estimation of Dolutegravir and Rilpivirine in Bulk and its Dosage Forms. Abstract The objective of the work is to develop and validate a new, simple, highly sensitive, stability indicating RP-HPLC method for simultaneous estimation of Dolutegravir and Rilpivirine in bulk and its dosage f...
متن کامل